A Semantic Completeness Proof for TaMeD
نویسندگان
چکیده
Deduction modulo is a theoretical framework designed to introduce computational steps in deductive systems. This approach is well suited to automated theorem proving and a tableau method for firstorder classical deduction modulo has been developed. We reformulate this method and give an (almost constructive) semantic completeness proof. This new proof allows us to extend the completeness theorem to several classes of rewrite systems used for computations in deduction modulo. We are then able to build a counter-model when a proof fails
منابع مشابه
TaMeD: A Tableau Method for Deduction Modulo
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation of computational and deductive steps. A sequent calculus modulo has been defined in (Dowek et al., 2003) as well as a resolution-based proof search method, in which the congruences are handled through rewrite rules on...
متن کاملOn the Completeness of Dynamic Logic
The impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: “local” semantic completeness on the one hand (Cook’s relative completeness, Harel’s Arithmetical completeness), and completeness with respect to other forms of reasoning about programs, on the other. However, local semantic complete...
متن کاملErratic Fudgets: A Semantic Theory for an Embedded Coordination Language
The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-speciic programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is...
متن کاملSome Remarks on Transfinite E-Semantic Trees and Superposition
We prove the refutational completeness of Pmep by proof techniques employed in establishing the completeness of weak superposition [9]. By giving a counter-example we show that the same approach is impossible wrt. Peqf . Hence, this result shows a semantic differences between Pmep and Peqf . We apply the result to Automated Model Building.
متن کاملSome Remarks on Transsnite E-semantic Trees and Superposition
We prove the refutational completeness of P mep by proof techniques employed in establishing the completeness of weak superposition 9]. By giving a counterexample we show that the same approach is impossible wrt. P eqf. Hence, this result shows a semantic diierences between P mep and P eqf. We apply the result to Automated Model Building.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006